Reducibility Among Combinatorial Problems
نویسنده
چکیده
منابع مشابه
On Self-Reducibility and Reoptimization of Closest Substring Problem
In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest substring is still NP-hard. We investigate the combinatorial property of optimization problems called self-reducibility. We show that problems that are polynomia...
متن کاملCombinatorics, Complexity, and Randomness, 1985
Richard M. Karp, of the University of California-Berkeley, received the 1985 ACM A. M. Taring Award for his fundamental contributions to complexity theory. Presented at the Association's Annual Conference in Denver, Colorado, in October, the award is ACM's highest honor in computer science research. By 1972, Karp had established a reputation as one of the world's leading computer science theori...
متن کاملOn Uniform Relationships between Combinatorial Problems
The enterprise of comparing mathematical theorems according to their logical strength is an active area in mathematical logic, with one of the most common frameworks for doing so being reverse mathematics. In this setting, one investigates which theorems provably imply which others in a weak formal theory roughly corresponding to computable mathematics. Since the proofs of such implications tak...
متن کاملSparse Variations and Reducibility among Prediction Problems Authors :
We investigate the relationship between two di erent notions of reducibility among prediction (learning) problems within the distribution-free learning model of Valiant (PAC learning model [7, 2].) The notions of reducibility we consider are the analogues for prediction problems of the many-one reducibility and of the Turing reducibility. The former is the notion of prediction preserving reduci...
متن کاملApproximate Solution of NP Optimization Problems
This paper presents the main results obtained in the field of approximation algorithms in a unified framework. Most of these results have been revisited in order to emphasize two basic tools useful for characterizing approximation classes, that is, combinatorial properties of problems and approximation preserving reducibilities. In particular, after reviewing the most important combinatorial ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1972